Enumerating and Generating Labeled k-degenerate Graphs
نویسندگان
چکیده
A k-degenerate graph is a graph in which every induced subgraph has a vertex with degree at most k. The class of k-degenerate graphs is interesting from a theoretical point of view and it plays an interesting role in the theory of fixed parameter tractability since some otherwise W[2]-hard domination problems become fixed-parameter tractable for k-degenerate graphs. It is a well-known fact that the k-degenerate graphs are exactly the graphs whose vertex-set can be well-ordered such that each vertex is incident to at most k larger vertices with respect to this ordering. A well-ordered k-degenerate graph is a labeled graph with vertex-labels 1, . . . , n such that the ordering of the vertices by their labels is a well-ordering of the graph. We consider the problem of enumerating and generating well-ordered k-degenerate graphs with a given number of vertices and with a given number of vertices and edges, respectively, uniformly at random. By generating wellordered k-degenerate graphs we generate at least one labeled copy of each unlabeled k-degenerate graph and we filter some but not all isomorphies compared to the classical labeled approach. We also introduce the class of strongly k-degenerate graphs, which are k-degenerate graphs with minimum degree k. These graphs are a natural generalization of k-regular graphs which can be used in order to generate graphs with predefined core-decomposition. We present efficient algorithms for generating wellordered k-degenerate graphs with given number of vertices (and edges). After a precomputation which must only be performed once when generating more than one well-ordered k-degenerate graph these algorithms are almost optimal. Additionally, we present complete non-uniform generators for these classes with optimal running time. We also present an efficient and complete generator for well-ordered strongly k-degenerate graphs with given number of vertices (and edges). Finally, we present efficient algorithms for enumerating well-ordered k-degenerate and strongly k-degenerate graphs.
منابع مشابه
Enumerating labeled graphs with a k-cycle
Cayley’s Tree Formula for enumerating labeled trees is well known. In this paper a more general result is presented for graphs with exactly one k-cycle (i.e. cycle on k vertices ).It is proved that for all integers n and k such that (n ≥ k ≥ 3), the number of possible labeled graphs on n vertices that contain exactly one k-cycle is ( n−1 k−1 ) nn−k. 1 ar X iv :0 90 9. 24 00 v1 [ m at h. C O ] 1...
متن کاملA note on 3-Prime cordial graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کامل4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کامل$k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
متن کاملEnumerating the Nash equilibria of rank 1-games
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke– Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-d...
متن کامل